首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   2547篇
  免费   187篇
  国内免费   203篇
化学   181篇
晶体学   1篇
力学   79篇
综合类   36篇
数学   1888篇
物理学   752篇
  2023年   23篇
  2022年   38篇
  2021年   62篇
  2020年   71篇
  2019年   69篇
  2018年   81篇
  2017年   76篇
  2016年   72篇
  2015年   50篇
  2014年   124篇
  2013年   237篇
  2012年   79篇
  2011年   121篇
  2010年   108篇
  2009年   163篇
  2008年   178篇
  2007年   162篇
  2006年   139篇
  2005年   131篇
  2004年   85篇
  2003年   114篇
  2002年   106篇
  2001年   96篇
  2000年   79篇
  1999年   61篇
  1998年   66篇
  1997年   59篇
  1996年   46篇
  1995年   33篇
  1994年   27篇
  1993年   16篇
  1992年   20篇
  1991年   14篇
  1990年   15篇
  1989年   5篇
  1988年   13篇
  1987年   10篇
  1986年   7篇
  1985年   9篇
  1984年   6篇
  1983年   10篇
  1982年   12篇
  1981年   2篇
  1980年   9篇
  1979年   5篇
  1978年   7篇
  1977年   6篇
  1976年   4篇
  1975年   3篇
  1974年   3篇
排序方式: 共有2937条查询结果,搜索用时 46 毫秒
1.
2.
3.
4.
We solve a combinatorial question concerning eigenvalues of the universal intertwining endomorphism of a subset representation.  相似文献   
5.
We define the notion of basic set data for finite groups (building on the notion of basic set, but including an order on the irreducible characters as part of the structure), and we prove that the Springer correspondence provides basic set data for Weyl groups. Then we use this to determine explicitly the modular Springer correspondence for classical types (defined over a base field of odd characteristic p, and with coefficients in a field of odd characteristic ?p): the modular case is obtained as a restriction of the ordinary case to a basic set. In order to do so, we compare the order on bipartitions introduced by Dipper and James with the order induced by the Springer correspondence. We provide a quick proof, by sorting characters according to the dimension of the corresponding Springer fibre, an invariant which is directly computable from symbols.  相似文献   
6.
Machine learning is currently the most active interdisciplinary field having numerous applications;additionally,machine-learning techniques are used to research quantum many-body problems.In this study,we first propose neural network quantum states(NNQSs)with general input observables and explore a few related properties,such as the tensor product and local unitary operation.Second,we determine the necessary and sufficient conditions for the representability of a general graph state using normalized NNQS.Finally,to quantify the approximation degree of a given pure state,we define the best approximation degree using normalized NNQSs.Furthermore,we observe that some 7V-qubit states can be represented by a normalized NNQS,such as separable pure states,Bell states and GHZ states.  相似文献   
7.
The aim of this paper is to present a new classification and regression algorithm based on Artificial Intelligence. The main feature of this algorithm, which will be called Code2Vect, is the nature of the data to treat: qualitative or quantitative and continuous or discrete. Contrary to other artificial intelligence techniques based on the “Big-Data,” this new approach will enable working with a reduced amount of data, within the so-called “Smart Data” paradigm. Moreover, the main purpose of this algorithm is to enable the representation of high-dimensional data and more specifically grouping and visualizing this data according to a given target. For that purpose, the data will be projected into a vectorial space equipped with an appropriate metric, able to group data according to their affinity (with respect to a given output of interest). Furthermore, another application of this algorithm lies on its prediction capability. As it occurs with most common data-mining techniques such as regression trees, by giving an input the output will be inferred, in this case considering the nature of the data formerly described. In order to illustrate its potentialities, two different applications will be addressed, one concerning the representation of high-dimensional and categorical data and another featuring the prediction capabilities of the algorithm.  相似文献   
8.
9.
10.
In this paper, we prove the possibility of optimization of some free parameters of Meixner-like discrete-time linear filters using orthonormal basis functions (OBF) in an analytical way. Since the z-transform of the Meixner filters is impossible and it is possible for Meixner-like filters, we are motivated to study closely the optimization of the Meixner-like's pole. As a result, the differential equation associated with Meixner-like filters has been developed. On the other hand, the effective width of the energy distribution in the transformation domain is a function of the free parameter (Meixner-like pole) and simple signal measurements and can be calculated by the second-order moment. Analytic minimization of the second-order moment gives an optimal value of the free parameter. To validate the effectiveness of the proposed approach, numerical results are used to determine the free parameters.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号